翻訳と辞書 Words near each other ・ List of compositions by Frederic Rzewski ・ List of compositions by Frederick Delius ・ List of compositions by Frederik Magle ・ List of compositions by Friedrich Kalkbrenner ・ List of company registers ・ List of company towns ・ List of company towns in Canada ・ List of company towns in the United States ・ List of comparative military ranks ・ List of competent harbour authorities ・ List of competitive eaters ・ List of compilation albums by The Fall ・ List of compilers ・ List of complex analysis topics ・ List of complex and algebraic surfaces ・ List of complexity classes ・ List of component units of British 1st Armoured Division ・ List of component units of British 1st Infantry Division ・ List of component units of Fighter Command ・ List of Component Units of the British 4th Armoured Brigade, World War II ・ List of components of oil drilling rigs ・ List of composers and their preferred lyricists ・ List of composers by name ・ List of composers by nationality ・ List of composers depicted on film ・ List of composers for lute ・ List of composers for the classical guitar ・ List of composers for the classical guitar (chronological) ・ List of composers for the classical guitar (nationality) ・ List of composers from Brittany Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク List of complexity classes ： ウィキペディア英語版 List of complexity classes This is a list of complexity classes in computational complexity theory. For other computational and complexity subjects, see list of computability and complexity topics. Many of these classes have a 'co' partner which consists of the complements of all languages in the original class. For example if a language L is in NP then the complement of L is in co-NP. (This doesn't mean that the complement of NP is co-NP - there are languages which are known to be in both, and other languages which are known to be in neither.) "The hardest problems" of a class refer to problems, which belong to the class and every other problem of that class can be reduced to it. Furthermore, the reduction is also a problem of the given class, or its subset. If you don't see a class listed (such as co-UP) you should look under its partner (such as UP). == References == 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「List of complexity classes」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.